// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
int cou=0;
bool f=0,b=0;
void dfs(int n,int a,int b,bool z)
{
	if(++cou>100)return;
	if(z==1&&((a==1&&a+1==b)||(a==n&&a-1==b)))
	{
		return;
	}
	if(z==0&&((b==1&&b+1==a)||(b==n&&b-1==a))&&f==0)
	{
		cout<<"YES"<<endl;
		f=1;
		return;
	}
	if(a-1!=b&&a!=1)dfs(n,a-1,b,0);
	if(a+1!=b&&a!=n)dfs(n,a+1,b,0);
	if(b-1!=a&&b!=1)dfs(n,a,b-1,1);
	if(b+1!=a&&b!=n)dfs(n,a,b+1,1);
}
signed main()
{
	int t;
	cin>>t;
	int n,a,b;
	while(t--)
	{
		cin>>n>>a>>b;
		if(abs(a-b-1)%2==1)cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
	return 0;
}
